A 3 dimensional Digital Image Skeltonization using 3x3x3 Structuring Element
نویسندگان
چکیده
Image Skeletonization promises to be a powerful complexity-cutting tool for compact shape description, pattern recognition, robot vision, animation, petrography pore space fluid flow analysis, model/analysis of bone/lung/circulation, and image compression for telemedicine. The existing image thinning/skeletonization techniques using boundary erosion, distance coding, and Voronoi diagram are first overviewed to assess/compare their feasibility of extending from 2D to 3D. Previously, skeletons have been a common tool for identifying shape components in a solid object. However, obtaining skeletons of a grayscale volume poses new challenges due to the lack of a clear boundary between object and background. In this paper we propose a fast, efficient and robust algorithm to generate the skeleton of large, complex 3D images such as CT, MRI data which make use of 3X3X3 structuring elements for processing. This algorithm has been developed in the frame work of cellular logic array processing. Cellular logic array processing is a logico mathematical paradigm developed using the fundamental notions of normal algorithms and cellular automata. The algorithm provides a straightforward computation which is robust and not sensitive to noise or object boundary complexity. Because 3D skeleton may not be unique, several application-dependent skeletonization options will be explored for meeting specific quality/speed requirements.
منابع مشابه
Algebra of Three Dimensional Geometric Filters and Its Relevance in 3-d Image Processing
This paper gives a novel concept of what we call as Geometric Filters defined over a 3-D rectangular grid of pixels. These G-Filters have potential applications to processing of volumetric images. In addition, the paper describes in brief the algebra of G-Filters by formulating a lattice of convex polyhedrons (structuring elements) constructed in a 3X3X3 grid of pixels. The results are visualiz...
متن کاملA fast implementation of 3-D binary morphological transformations
This paper proposes a fast algorithm for implementing the basic operation of Minkowski addition for the special case of binary three-dimensional (3-D) images, using 3-D structuring elements of arbitrary size and shape. The application of the proposed algorithm for all the other morphological transformations is straightforward, as they can all be expressed in terms of Minkowski addition. The eff...
متن کاملErosion and Dilation on 2-D and 3-D Digital Images: A New Size-Independent Approach
This paper presents a new approach to achieve elementary neighborhood operations on both 2D and 3D binary images by using the Extreme Vertices Model (EVM), a recent orthogonal polyhedra representation applied to digital images. The operations developed here are erosion and dilation. In contrast with previous techniques, this method do not use a voxel-based approach but deal with the inner secti...
متن کاملMorphological Structuring Elements
For image processing systems that have a limited size of region of support, say 3 x 3, direct implementation of morphological operations by a structuring element larger than the prefixed size is impossible. The decomposition of morphological operations by a large structuring element into a sequence of recursive operations, each using a smaller structuring element, enables the implementation of ...
متن کاملAn Analogue VLSI Morphological Image Processing Circuit
We present an analogue VLSI circuit that performs morphological image processing operations on the focal plane. The circuit has been fabricated using a standard digital CMOS process. We exploit the parallelism of morphological image processing operations by using the massively parallel architecture of analogue VLSI arrays, achieving both high-speed and low-power computation [1]. The analogue ci...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013